FPT Algorithms for Embedding into Low-Complexity Graphic Metrics
نویسندگان
چکیده
منابع مشابه
FPT algorithms for embedding into low complexity graphic metrics
Given metric spaces (X,DX) and (Y,DY ), an embedding F : X → Y is an injective mapping from X to Y . Expansion eF and contraction cF of an embedding F : X → Y are defined as eF = max x1,x2( 6=x1)∈X DY (F (x1), F (x2)) DX(x1, x2) and cF = max x1,x2( 6=x1)∈X DX(x1, x2) DY (F (x1), F (x2)) , respectively and distortion dF is defined as dF = eF ·cF . Observe that dF ≥ 1. An embedding F : X → Y is n...
متن کامل(FPT-)Approximation Algorithms for the Virtual Network Embedding Problem
Many resource allocation problems in the cloud can be described as a basic Virtual Network Embedding Problem (VNEP): finding mappings of request graphs (describing the workloads) onto a substrate graph (describing the physical infrastructure). In the offline setting, the two natural objectives are profit maximization, i.e., embedding a maximal number of request graphs subject to resource constr...
متن کاملEmbedding approximately low-dimensional ℓ22 metrics into ℓ1
Goemans showed that any n points x1, . . . xn in d-dimensions satisfying `2 triangle inequalities can be embedded into `1, with worst-case distortion at most √ d. We consider an extension of this theorem to the case when the points are approximately low-dimensional as opposed to exactly low-dimensional, and prove the following analogous theorem, albeit with average distortion guarantees: There ...
متن کاملResilient and Low Stretch Routing through Embedding into Tree Metrics
This paper considers a fundamental problem of designing routing schemes that give low stretch and are resilient to node failures. The technique we use in this paper is through embedding into tree metrics, as a tree metric is a much simpler metric with many special features. However, routing on a spanning tree of the metric has a number of problems, in particular, the poor stretch and lack of re...
متن کاملEmbedding approximately low-dimensional $\ell_2^2$ metrics into $\ell_1$
Goemans showed that any n points x1, . . . xn in d-dimensions satisfying l 2 2 triangle inequalities can be embedded into l1, with worst-case distortion at most √ d. We extend this to the case when the points are approximately low-dimensional, albeit with average distortion guarantees. More precisely, we give an l2-to-l1 embedding with average distortion at most the stable rank, sr (M), of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2020
ISSN: 1942-3454,1942-3462
DOI: 10.1145/3369933